A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
نویسندگان
چکیده
منابع مشابه
A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
Methodology for the Capacitated Examination Timetabling Problem Salwani Abdullah, Samad Ahmadi, Edmund K. Burke, Moshe Dror and Barry McCollum 1 Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science & Information Technology, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, United Kingdom. School of Computing, De Montfort Universit...
متن کاملInvestigating Ahuja-Orlin's Large Neighbourhood Search for Examination Timetabling
Since the 1960’s automated approaches to examination timetabling have been explored and a wide variety of approaches have been investigated and developed. In this paper we build upon a recently presented, sequential solution improvement technique which searches efficiently over a very large set of ‘adjacent’ (neighbourhood) solutions. This solution search methodology, originally developed by Ah...
متن کاملInvestigating Ahuja-Orlin’s Large Neighbourhood Search Approach for Examination Timetabling
Since the 1960’s, automated approaches to examination timetabling have been explored and a wide variety of approaches have been investigated and developed. In this paper we build upon a recently presented, sequential solution improvement technique which searches efficiently over a very large set of ‘adjacent’ (neighbourhood) solutions. This solution search methodology, originally developed by A...
متن کاملTabu Search Techniques for Examination Timetabling
The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairly spreading the exams for the students, and satisfying room capacity constraints. We present a family of solution algorithms for a set of variants of the Examination Timetabling problem. The algorithms are based on tabu search...
متن کاملA Tabu-based Memetic Approach to the Examination Timetabling Problem
Constructing examination timetable for higher educational institutions is a very complex work due to the complexity of timetabling problems. The objective of examination timetabling problem is to satisfy the hard constraints and minimize the violations of soft constraints. In this paper, a tabu-based memetic approach has been applied and evaluated against the latest methodologies in the literat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2007
ISSN: 0160-5682,1476-9360
DOI: 10.1057/palgrave.jors.2602258